


	IMPERIUL ROMAN - SOLUTIE
       --------------------------

	Se aplica Roy-Floyd, pt. a se afla
drumurile minime intre oricare doua orase.

	Apoi,


CMIN:=INFINIT;

FOR I=1 TO N DO
FOR J=1 TO N DO
BEGIN
{ - Se incearca unirea celor 4 orase folosind orasele I si J - }

CACT:=MIN(DIST[1,I],DIST[1,J]) + MIN(DIST[2,I],DIST[2,J]) +
MIN(DIST[3,I],DIST[3,J]) + MIN(DIST[4,I],DIST[4,J]) + DIST[I,J]

IF CACT<CMIN THEN
BEGIN
CMIN:=CACT;
END;


END;